Airspace sectorization with constraints
نویسندگان
چکیده
We consider the Airspace Sectorization Problem (ASP) in which airspace has to be partitioned into a given number of sectors, each of which being assigned to a team of air traffic controllers. The objective is to minimize the coordination workload between adjacent sectors while balancing the total workload of controllers. Many specific constraints, including both geometrical and aircraft related constraints are taken into account. The problem is solved in a constraint programming framework. Experimental results show that our approach can be used on real life problems.
منابع مشابه
A Sectorization Method for Dynamic Airspace Configuration
The Dynamic Airspace Configuration (DAC) concept requires strategically organizing and efficiently allocating airspace. In the current National Airspace System (NAS), sector boundaries have been developed heuristically over decades in light of historical data and analysis. In our previous efforts, a graph model based on air route structure was developed to model the en-route airspace over the U...
متن کاملOptimized Sectorization of Airspace with Constraints
In this paper we consider the Optimized Airspace Sectorization Problem (ASP) with constraints in which a given airspace is to be partitioned into a number of sectors. The objective of ASP is to minimize the coordination workload between adjacent sectors. We proposed a constraint programming approach to optimize the sectorization that shall satisfy all specific constraints e.g. the controllers’ ...
متن کاملBalancing Controllers’ Workload by Locally Redesigning Airspace Sectors
We study an Airspace Resectorization Problem (ARP). A sectorization is a subdivision of an airspace into sectors, each managed by an airtraffic controller. A wellbalanced sectorization is a sectorization that distributes the workload evenly among the controllers. We discuss the problem of generating optimal sectorizations and describe GeoSect-Local, a tool that improves a given sectorization by...
متن کاملLocal Redesigning of Airspace Sectors
In this paper we study the Airspace Sectorization Problem (ASP) where the goal is to find an optimal partition (sectorization) of the airspace into a certain number of sectors, each managed by an air traffic controller. The objective of the ASP is to find a “well-balanced” sectorization that distributes the workload evenly among the controllers. We formulate the ASP as a partitioning problem of...
متن کاملA Comparison of Algorithm Generated Sectorizations
This paper discusses a comparison of several algorithm generated airspace boundary designs, known as sectorizations. Three algorithms are chosen that approach the airspace sectorization problem in different ways and produce radically different looking sectorizations due to the disparity in their methods. Simulations of air traffic using each of the sectorizations is completed and their resultin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- RAIRO - Operations Research
دوره 39 شماره
صفحات -
تاریخ انتشار 2005